Biased Random Walks, Lyapunov Functions, and Stochastic Analysis of Best Fit Bin Packing (Preliminary Version)
نویسندگان
چکیده
We study the Best Fit algorithm for on line bin packing under the distribution in which the item sizes are uniformly distributed in the discrete range f k k j kg Our main result is that in the case j k the asymptotic expected waste remains bounded This settles an open problem of Co man et al and involves a detailed analysis of the in nite multi dimensional Markov chain underlying the algorithm
منابع مشابه
An Alternative Heuristics for Bin Packing Problem
This study describes an alternative development of metaheuristic approaches to automate a one dimensional problem. Extensive computational testing is done to demonstrate the effectiveness of the proposed heuristic, a Variable Neighbourhood Search (VNS)-based algorithm. Several heuristics algorithms that have been used for solving the bin packing problem, Exact algorithm, Random Algorithm, First...
متن کاملBest-fit Bin-packing with Random Order Ecole Normale Supérieure De Lyon Best-fit Bin-packing with Random Order Best-fit Bin-packing with Random Order
Best t is the best known algorithm for on line bin packing in the sense that no algorithm is known to behave better both in the worst case and in the average uniform case In practice Best t appears to perform within a few percent of optimal In this paper we study the expected performance ratio taking the worst case multiset of items L and assuming that the elements of L are inserted in random o...
متن کاملDivergence-proving Techniques for Best Fit Bin Packing and Random Fit
This work discusses my attempts to extend Kenyon and Mitzenmacher’s technique for proving diveregnce of the online approximation algorithm Best Fit to Random Fit – another approximation algorithm for the well-known NP-hard problem of bin packing. In specific, the paper goes over Kenyon and Mitzenmacher’s recent advances on divergence of the waste of Best Fit bin packing for the skewed distribut...
متن کاملOnline Bin Covering: Expectations vs. Guarantees
Bin covering is a dual version of classic bin packing. Thus, the goal is to cover as many bins as possible, where covering a bin means packing items of total size at least one in the bin. For online bin covering, competitive analysis fails to distinguish between most algorithms of interest; all “reasonable” algorithms have a competitive ratio of 1 2 . Thus, in order to get a better understandin...
متن کاملOnline Bandwidth packing with symmetric distribution
We consider the following stochastic bin packing process: the items arrive continuously over time to a server and are packed into bins of unit size according to an online algorithm. The unpacked items form a queue. The items have random sizes with symmetric distribution. Our first contribution identifies some monotonicity properties of the queueing system that allow to derive bounds on the queu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Algorithms
دوره 27 شماره
صفحات -
تاریخ انتشار 1996